Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar1/SK90SLASH2.53.trs

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

G₂(h₁(x), y) -> G₂(x, y)
F₂(x, y) -> G₂(x, y)
G₂(h₁(x), y) -> F₂(x, y)

The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPAfsSolverProof

Q DP problem:
The TRS P consists of the following rules:

G₂(h₁(x), y) -> G₂(x, y)
F₂(x, y) -> G₂(x, y)
G₂(h₁(x), y) -> F₂(x, y)

The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

G₂(h₁(x), y) -> G₂(x, y)
G₂(h₁(x), y) -> F₂(x, y)

Used argument filtering: G₂(x1, x2) = x1
h₁(x1) = h₁(x1)
F₂(x1, x2) = x1
Used ordering: Precedence:

trivial

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPAfsSolverProof

        ↳ QDP

          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

F₂(x, y) -> G₂(x, y)

The TRS R consists of the following rules:

f₂(x, y) -> g₂(x, y)
g₂(h₁(x), y) -> h₁(f₂(x, y))
g₂(h₁(x), y) -> h₁(g₂(x, y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 0 SCCs with 1 less node.